Guesswork With Quantum Side Information
نویسندگان
چکیده
What is the minimum number of guesses needed on average to correctly guess a realization random variable? The answer this question led introduction notion quantity called guesswork by Massey in 1994, which can be viewed as an alternate security criterion entropy. In paper, we consider presence quantum side information, and show that general sequential guessing strategy equivalent performing single measurement choosing from outcome. We use result deduce entropic one-shot asymptotic bounds formulate semi-definite program (SDP) calculate quantity. evaluate for simple example involving BB84 states, both numerically analytically, prove continuity certifies slightly imperfect key states when used criterion.
منابع مشابه
Minimum guesswork discrimination between quantum states
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able to use a brute-force strategy to query the state, discrimination measurement with minimum error probability does not necessarily minimize the number of querie...
متن کاملClassical data compression with quantum side information
The problem of classical data compression when the decoder has quantum side information at his disposal is considered. This is a quantum generalization of the classical Slepian-Wolf theorem. The optimal compression rate is found to be H(X)−χ where H(X) is the Shannon entropy of the source and χ is the Holevo quantity of the ensemble describing the classicalquantum correlations between the sourc...
متن کاملBounds on Information Combining With Quantum Side Information
Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kin...
متن کاملCoding for quantum channels with side information at the transmitter
We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of such channels which closely parallels Gel’fand and Pinsker’s solution to the classical version of the same problem. This theorem can also be used to find a low...
متن کاملMeasurement compression with quantum side information using shared randomness
We consider the problem of measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Referee and Bob and she performs a measurement on her registers. She wishes to communicate the outcome of this measurement to Bob using shared randomness only, in such a way that the outcome that Bob receives is correctly correl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3118878